A new approach for solving neutrosophic integer programming problems
Authors
Abstract:
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, we introduce a new model for Neutrosophic Integer Programming Problems where the coefficient of problems are neutrosophic numbers and by using a new score function will propose a method for solving them.
similar resources
A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
full textA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
full textA New Approach for Solving Fully Fuzzy Bilevel Linear Programming Problems
This paper addresses a type of fully fuzzy bilevel linear programming (FFBLP) wherein all the coefficients and decision variables in both the objective function and constraints are triangular fuzzy numbers. This paper proposes a new simple-structured, efficient method for FFBLP problems based on crisp bilevel programming that yields fuzzy optimal solutions with unconstraint variables and parame...
full textA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
full textA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
full textAn Improved Approach For Solving Mixed-Integer Nonlinear Programming Problems
This special class of a nonlinear mathematical programming problem which is addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method and the notion of superbasics, ha...
full textMy Resources
Journal title
volume 9 issue 1
pages 1- 9
publication date 2019-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023